Reasoning about Common Knowledge with Infinitely Many Agents
نویسندگان
چکیده
Complete axiomatizations and exponential-time decision procedures are provided for reasoning about knowledge and common knowledge when there are infinitely many agents. The results show that reasoning about knowledge and common knowledge with infinitely many agents is no harder than when there are finitely many agents, provided that we can check the cardinality of certain set differences G − G′, where G and G′ are sets of agents. Since our complexity results are independent of the cardinality of the sets G involved, they represent improvements over the previous results even when the sets of agents involved are finite. Moreover, our results make clear the extent to which issues of complexity and completeness depend on how the sets of agents involved are represented. ∗Supported in part by NSF under grant IRI-96-25901. §Supported in part by NSF Grants DMS-9802843, DMS-0100035 and DOD MURI Grant SA1515PG.
منابع مشابه
Probabilistic Modal Logic
A modal logic is any logic for handling modalities: concepts like possibility, necessity, and knowledge. Artificial intelligence uses modal logics most heavily to represent and reason about knowledge of agents about others’ knowledge. This type of reasoning occurs in dialog, collaboration, and competition. In many applications it is also important to be able to reason about the probability of b...
متن کاملبررسی کنش‌های شناختی دانش‌آموزان دارای لکنت
Objective Stuttering is one of the most common speech disorders that generate many complications in children and adults. This disorder involves behavioral, cognitive and emotional interactions. So, the purpose of the current study is to investigate the cognitive functions of students with stuttering. Materials & Methods A descriptive study, comprising of 30 students (8 females and 22 males) fr...
متن کاملSyntactic Knowledge: A Logic of Reasoning, Communication and Cooperation
This paper presents a logic for reasoning about the explicit knowledge of agents who represent their knowledge as finite sets of logical formulae, and who can change their knowledge by reasoning and communicating. No assumptions about closure or consistency conditions on the sets, or about soundness or completeness of the reasoning mechanisms, are made. Traditional epistemic logic, based on mod...
متن کاملReasoning with Models of Probabilistic Knowledge over Probabilistic Knowledge
In multi-agent systems, the knowledge of agents about other agents’ knowledge often plays a pivotal role in their decisions. In many applications, this knowledge involves uncertainty. This uncertainty may be about the state of the world or about the other agents’ knowledge. In this thesis, we answer the question of how to model this probabilistic knowledge and reason about it efficiently. Modal...
متن کاملSpecifying and reasoning about uncertain agents
Logical formalisation of agent behaviour is desirable, not only in order to provide a clear semantics of agent-based systems, but also to provide the foundation for sophisticated reasoning techniques to be used on, and by, the agents themselves. The possible worlds semantics offered by modal logic has proved to be a successful framework in which to model mental attitudes of agents such as belie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999